Accelerating the ANSYS Direct Sparse Solver with GPUs
نویسندگان
چکیده
As hardware accelerators and especially GPUs become more and more popular to accelerate the compute intensive parts of an algorithm, standard high performance computing packages are starting to benefit from this trend. We present the first GPU acceleration of the ANSYS direct sparse solver. We explain how such a multifrontal solver may be accelerated using an optimized dense matrix factorization, and show that with the current generation of hardware, speed-ups of up to 4× can be obtained by utilizing mixed precision, and 2.9× in double precision. We discuss the impact of the model being studied on the overall performance, as well as the influence of using single precision factorizations on the accuracy of the solution.
منابع مشابه
Accelerating high-order WENO schemes using two heterogeneous GPUs
A double-GPU code is developed to accelerate WENO schemes. The test problem is a compressible viscous flow. The convective terms are discretized using third- to ninth-order WENO schemes and the viscous terms are discretized by the standard fourth-order central scheme. The code written in CUDA programming language is developed by modifying a single-GPU code. The OpenMP library is used for parall...
متن کاملAccelerating the GMRES Solver with Block ILU (K) Preconditioner on GPUs in Reservoir Simulation
The solution of sparse linear systems is the most time-consuming step in running reservoir simulations; over 70% of time is spent on the solution of linear systems derived from the Newton methods [1]. If large highly heterogeneous reservoir models are applied, their linear systems are even harder to solve and require much more simulation time. Hence fast solution techniques are fundamental to l...
متن کاملAdvancing Analysis Capabilities in Ansys through Solver Technology
This paper describes substantial improvements in analysis capabilities in a large scale commercial finite element program made possible by the implementation of solver technology. The ANSYS program is a commercial finite element analysis program, which has been in use for thirty years. The original code, developed around a direct frontal solver has been expanded over the years to include full f...
متن کاملA Distributed CPU-GPU Sparse Direct Solver
This paper presents the first hybrid MPI+OpenMP+CUDA implementation of a distributed memory right-looking unsymmetric sparse direct solver (i.e., sparse LU factorization) that uses static pivoting. While BLAS calls can account for more than 40% of the overall factorization time, the difficulty is that small problem sizes dominate the workload, making efficient GPU utilization challenging. This ...
متن کاملConcurrent Number Cruncher: An Efficient Sparse Linear Solver on the GPU
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of the mesh. The advent of GPUs with their ever-growing amount of parallel horsepower makes them a tempting resource for such numerical computations. This can be helped by new APIs (CTM from ATI and CUDA from NVIDIA) which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009